Costless delay in negotiations
نویسندگان
چکیده
Abstract We study bargaining models in discrete time with a finite number of players, stochastic selection the proposing player, endogenously determined sets and orders responders, set feasible alternatives. The standard optimality conditions system recursive equations may not be sufficient for existence subgame perfect equilibrium stationary strategies (SSPE) case costless delay. present characterization SSPE that is valid both costly address relationship between an under delay limit SSPEs vanishing An always exists when costly, but necessarily so delay, even mixed are allowed for. This surprising as quasi SSPE, solution to equations, exists. problem caused by potential singularity which intimately related possibility perpetual disagreement process.
منابع مشابه
Bargaining Delay in Multilateral Trade Negotiations
This paper theoretically and empirically explores bargaining delay in tariff negotiations. By imposing a bargaining structure in an equilibrium trade framework, I derive many testable predictions of delay. I then take my model to the newly compiled GATT (Torquay) tariff negotiation data, which includes detailed (product-level) information of the timing and contents of countries’ (back-and-forth...
متن کاملStrategic Delegation and Delay in Negotiations over the Bargaining Agenda
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملPairing Heaps with Costless Meld
Improving the structure and analysis in [1], we give a variation of the pairing heaps that has amortized zero cost per meld (compared to an O(log log n) in [1]) and the same amortized bounds for all other operations. More precisely, the new pairing heap requires: no cost per meld, O(1) per find-min and insert, O(log n) per delete-min, and O(log log n) per decrease-key. These bounds are the best...
متن کاملCostless Signaling with Costly Signals
We study signaling environments with two features that are common in practice: first, complete-information bliss points are heterogeneous across different types of senders; second, receivers observe many choices by each sender, rather than a single decision. We prove that, ironically, a sufficiently large increase in the weight attached to signaling costs allows senders to signal their true typ...
متن کاملprediction of ignition delay period in d.i diesel engines
a semi-empirical mathematical model for predicting physical part of ignition delay period in the combustion of direct - injection diesel engines with swirl is developed . this model based on a single droplet evaporation model . the governing equations , namely , equations of droplet motion , heat and mass transfer were solved simultaneously using a rung-kutta step by step unmerical method . the...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Economic Theory
سال: 2021
ISSN: ['1432-0479', '0938-2259']
DOI: https://doi.org/10.1007/s00199-021-01373-6